<?xml version="1.0" encoding="ISO-8859-1"?>
<metadatalist>
	<metadata ReferenceType="Conference Proceedings">
		<site>sibgrapi.sid.inpe.br 802</site>
		<holdercode>{ibi 8JMKD3MGPEW34M/46T9EHH}</holdercode>
		<identifier>8JMKD3MGPBW34M/3DJ998E</identifier>
		<repository>sid.inpe.br/sibgrapi/2013/02.17.22.23</repository>
		<lastupdate>2013:02.17.22.23.21 sid.inpe.br/banon/2001/03.30.15.38 administrator</lastupdate>
		<metadatarepository>sid.inpe.br/sibgrapi/2013/02.17.22.23.21</metadatarepository>
		<metadatalastupdate>2022:09.13.03.49.16 sid.inpe.br/banon/2001/03.30.15.38 administrator {D 1995}</metadatalastupdate>
		<isbn>978-85-7669-273-7</isbn>
		<citationkey>Velho:1995:AdPoMa</citationkey>
		<title>Adaptive polygonization made simple</title>
		<format>Impresso, On-line.</format>
		<year>1995</year>
		<numberoffiles>1</numberoffiles>
		<size>5579 KiB</size>
		<author>Velho, Luiz Carlos Pacheco Rodrigues,</author>
		<affiliation>Instituto de Matemática Pura e Aplicada (IMPA)</affiliation>
		<editor>Lotufo, Roberto de Alencar,</editor>
		<editor>Mascarenhas, Nelson Delfino d'Ávila,</editor>
		<e-mailaddress>cintiagraziele.silva@gmail.com</e-mailaddress>
		<conferencename>Simpósio Brasileiro de Computação Gráfica e Processamento de Imagens, 8 (SIBGRAPI)</conferencename>
		<conferencelocation>São Carlos, SP, Brazil</conferencelocation>
		<date>25-27 Oct. 1995</date>
		<publisher>Sociedade Brasileira de Computação</publisher>
		<publisheraddress>Porto Alegre</publisheraddress>
		<pages>111-118</pages>
		<booktitle>Anais</booktitle>
		<tertiarytype>Artigo</tertiarytype>
		<transferableflag>1</transferableflag>
		<keywords>polygonization, polygonization simplified, implicit surfaces.</keywords>
		<abstract>This paper describes a simple for the algorithm for the adaptive polygonization of implicit surfaces. It gives a practical way to construct optimal piecewise linear representations. The method starts with a coarse uniform polygonal approximation of the surface and subdivides each polygon recursively according to local curvature. In that way, the inherent complexity of the problem is tamed by reducing part of the full three dimensional search to two dimensions.</abstract>
		<type>Modelagem Geométrica</type>
		<language>en</language>
		<targetfile>14 Adaptive polygonization made simple.pdf</targetfile>
		<usergroup>cintiagraziele.silva@gmail.com</usergroup>
		<visibility>shown</visibility>
		<mirrorrepository>sid.inpe.br/sibgrapi@80/2007/08.02.16.22</mirrorrepository>
		<nexthigherunit>8JMKD3MGPEW34M/4742MCS</nexthigherunit>
		<nexthigherunit>8JMKD3MGPBW34M/3DKGHN2</nexthigherunit>
		<nexthigherunit>8JMKD3MGPBW34M/3DL29P8</nexthigherunit>
		<citingitemlist>sid.inpe.br/sibgrapi/2013/02.25.18.00 2</citingitemlist>
		<citingitemlist>sid.inpe.br/sibgrapi/2013/02.20.16.53 1</citingitemlist>
		<citingitemlist>sid.inpe.br/banon/2001/03.30.15.38.24 1</citingitemlist>
		<hostcollection>sid.inpe.br/banon/2001/03.30.15.38</hostcollection>
		<username>cintiagraziele.silva@gmail.com</username>
		<lasthostcollection>sid.inpe.br/banon/2001/03.30.15.38</lasthostcollection>
		<url>http://sibgrapi.sid.inpe.br/rep-/sid.inpe.br/sibgrapi/2013/02.17.22.23</url>
	</metadata>
</metadatalist>